Response Surface Method for Reliability Analysis Based on Iteratively-Reweighted-Least-Square Extreme Learning Machines

نویسندگان

چکیده

A response surface method for reliability analysis based on iteratively-reweighted-least-square extreme learning machines (IRLS-ELM) is explored in this paper, which, highly nonlinear implicit performance functions of structures are approximated by the IRLS-ELM. Monte Carlo simulation then carried out approximate IRLS-ELM structural analysis. Some numerical examples given to illustrate proposed method. The effects parameters involved accuracy respectively discussed. results exhibit that a proper number samples and neurons hidden layer nodes, an appropriate regularization parameter, iterations reweighting important assurance obtain reasonable precision estimating failure probability.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple Task Learning Using Iteratively Reweighted Least Square

Multiple task learning (MTL) is becoming popular due to its theoretical advances and empirical successes. The key idea of MTL is to explore the hidden relationships among multiple tasks to enhance learning performance. Recently, many MTL algorithms have been developed and applied to various problems such as feature selection and kernel learning. However, most existing methods highly relied on c...

متن کامل

An Iteratively Reweighted Least Square Implementation for Face Recognition

We propose, as an alternative to current face recognition paradigms, an algorithm using reweighted l2 minimization, whose recognition rates are not only comparable to the random projection using l1 minimization compressive sensing method of Yang et al [5], but also robust to occlusion. Through numerical experiments, reweighted l2 mirrors the l1 solution [1] even with occlusion. Moreover, we pre...

متن کامل

Improved Iteratively Reweighted Least Squares for Unconstrained

In this paper, we first study q minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained q minimization, for which we show a few advantages on noisy measurements and/or approximately sparse vectors. Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1–38] for constrained ...

متن کامل

A Second Order Learning Scheme based on Iteratively Reweighted Least Squares

In this work we demonstrate a method to obtain maximum likelihood weight estimates for a multilay-ered feedforward neural network using least squares. This method has certain advantages when compared to other second-order methods. The proposed method uses the Fisher's information matrix instead of the Hessian matrix to compute the search direction. Since this matrix is formulated as an inner pr...

متن کامل

A note on privacy preserving iteratively reweighted least squares

Iteratively reweighted least squares (IRLS) is a widely-used method in machine learning to estimate the parameters in the generalised linear models. In particular, IRLS for L1 minimisation under the linear model provides a closed-form solution in each step, which is a simple multiplication between the inverse of the weighted second moment matrix and the weighted first moment vector. When dealin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2023

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics12071741